Linear Vector Recurrences
نویسنده
چکیده
General solution methods for linear vector recurrences are considered; an algorithm based on partial fraction expansion is shown to be the most efficient way of solving this problem.
منابع مشابه
Solving Linear Recurrences with Loop Raking
We present a variation of the partitionmethod for solving mth-order linear recurrences that is well-suited to vector multiprocessors. The algorithm fully utilizes both vector and multiprocessor capabilities, and reduces the number of memory accesses as compared to the more commonly used version of the partition method. Our variation uses a general loop restructuring technique called loop raking...
متن کاملNew Fast Algorithms for First-Order Linear Recurrences on Vector Computers
We examine the performance of parallel algorithms for rst-order linear recurrence on vector computers, evaluate them quantitatively on a simple model of vector computers, and propose new fast algorithms. We also show a result of performance benchmarking of them on actual vector computers.
متن کاملScalable Techniques for Computing Band Linear Recurrences on Massively Parallel and Vector Supercomputers
In this paper, we present a new scalable algorithm, called the Regular Schedule, for parallel evaluation of band linear recurrences (BLR's, i.e., mth-order linear recurrences for m 1). Its scalability and simplicity make it well suited for vector supercomputers and massively parallel computers. We describe our implementation of the Regular Schedule on two types of machines: the Convex C240 and ...
متن کاملAn Implementation of the QMR Method Based on Coupled Two-Term Recurrences
Recently, the authors have proposed a new Krylov subspace iteration, the quasi-minimal residual algorithm (QMR), for solving non-Hermitian linear systems. In the original implementation of the QMR method, the Lanczos process with look-ahead is used to generate basis vectors for the underlying Krylov subspaces. In the Lanczos algorithm, these basis vectors are computed by means of three-term rec...
متن کاملComputing Programs Containing Band Linear Recurrences on Vector Supercomputers
Many large-scale scienti c and engineering computations, e.g., some of the Grand Challenge problems [1], spend a major portion of execution time in their core loops computing band linear recurrences (BLR's). Conventional compiler parallelization techniques [4] cannot generate scalable parallel code for this type of computation because they respect loop-carried dependences (LCD's) in programs an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014